The Addition of Bounded Quantification and Partial Functions to a Computational Logic and Its Theorem Prover 1. Introduction (for X in L Collect (times 2 X)) and (for X in L Collect (add1 X))

We describe an extension to our quantifier-free computational logic to provide the expressive power and convenience of bounded quantifiers and partial functions. By quantifier we mean a formal construct which introduces a bound or indicial variable whose scope is some subexpression of the quantifier expression. A familiar quantifier is the Σ operator which sums the values of an expression over some range of values on the bound variable. Our method is to represent expressions of the logic as objects in the logic, to define an interpreter for such expressions as a function in the logic, and then define quantifiers as "mapping functions." The novelty of our approach lies in the formalization of the interpreter and its interaction with the underlying logic. Our method has several advantages over other formal systems that provide quantifiers and partial functions in a logical setting. The most important advantage is that proofs not involving quantification or partial recursive functions are not complicated by such notions as "capturing," "bottom," or "continuity." Naturally enough, our formalization of the partial functions is nonconstructive. The theorem prover for the logic has been modified to support these new features. We describe the modifications. The system has proved many theorems that could not previously be stated in our logic. Among them are: • classic quantifier manipulation theorems, such as Σ i=0 n g(i)+h(i) = Σ i=0 n g(i) + Σ i=0 n h(i); • elementary theorems involving quantifiers, such as the Binomial Theorem: (a+b)n = Σ i=0 n (i)a ibn-i; • termination properties of many partial recursive functions such as the fact that an application of the partial function described by (LEN X) @val(ARROW) (IF (EQUAL X NIL) 0 (ADD1 (LEN (CDR X)))) terminates if and only if the argument ends in NIL; • theorems about functions satisfying unusual recurrence equations such as the 91function and the following list reverse function: (RV X) @val(ARROW) (IF (AND (LISTP X) (LISTP (CDR X))) (CONS (CAR (RV (CDR X))) (RV (CONS (CAR X) (RV (CDR (RV (CDR X))))))) X).